Finding common structured patterns in linear graphs
نویسندگان
چکیده
منابع مشابه
Finding common structured patterns in linear graphs
A linear graph is a graph whose vertices are linearly ordered. This linear ordering allows pairs of disjoint edges to be either preceding (<), nesting (@) or crossing (G). Given a family of linear graphs, and a non-empty subset R ⊆ {<,@, G}, we are interested in the Maximum Common Structured Pattern (MCSP) problem: find a maximum size edgedisjoint graph, with edge pairs all comparable by one of...
متن کاملCommon Structured Patterns in Linear Graphs: Approximations and Combinatorics
A linear graph is a graph whose vertices are linearly ordered. This linear ordering allows pairs of disjoint edges to be either preceding (<), nesting (@) or crossing (G). Given a family of linear graphs, and a non-empty subset R ⊆ {<, @, G} of these three relations, we are interested in the Maximum Common Structured Pattern (MCSP) problem: Find a maximum size edge-disjoint graph, with edge-pai...
متن کاملCommon Structured Patterns in Linear Graphs: Approximation and Combinatorics
A linear graph is a graph whose vertices are linearly ordered. This linear ordering allows pairs of disjoint edges to be either preceding (<), nesting (⊏) or crossing (≬). Given a family of linear graphs, and a non-empty subset R ⊆ {<,⊏, ≬}, we are interested in the MCSP problem: Find a maximum size edge-disjoint graph, with edge-pairs all comparable by one of the relations in R, that occurs as...
متن کاملFinding Cross Genome Patterns in Annotation Graphs
Annotation graph datasets are a natural representation of scientific knowledge. They are common in the life sciences where concepts such as genes and proteins are annotated with controlled vocabulary terms from ontologies. Scientists are interested in analyzing or mining these annotations, in synergy with the literature, to discover patterns. Further, annotated datasets provide an avenue for sc...
متن کاملFinding approximate patterns in undirected acyclic graphs
We consider an approximate pattern matching problem for undirected acyclic graphs. Speciically, let P be a pattern graph, D a data graph and t an integer. We present an algorithm to locate a subgraph in D whose distance from P is at most t. The distance measure used here is the degree-2 metric published previously. The time complexity of our algorithm is O(N P N D d p dlog d) where N P and N D ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Theoretical Computer Science
سال: 2010
ISSN: 0304-3975
DOI: 10.1016/j.tcs.2010.02.017